Graph DSLs : A Survey on Green-Marl & Sparql

نویسنده

  • Thejaka Amila Kanewala
چکیده

Many real world problems are formulated as graphs and standard graph processing algorithms are used to search solutions. Applications of graphs and related algorithms can be found in many domains. Domains vary from standard scientific applications to social media applications such as facebook. Creating and processing graphs in HPC environments adds lot of complexities. Hiding detail complexities and yet achieving the necessary performance enables lot of people to develop graph applications. In this paper we discuss about 2 such graph specific programming languages; 1. Green-Marl an imperative programming language for graph processing, 2. SPARQL An SQL like query language for graph processing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tech Report: Compiling GreenMarl into GPS

The massive size of the data in large graph processing requires distributed processing. However, conventional frameworks for distributed graph processing, such as Pregel, use programming models that are well-suited for scalability but inconvenient for programming graph algorithms. In this paper, we use Green-Marl, a Domain-Specific Language for graph analysis, to describe graph algorithms intui...

متن کامل

Amalgamation of domain specific languages with behaviour

Domain-specific languages (DSLs) become more useful the more specific they are to a particular domain. The resulting need for developing a substantial number of DSLs can only be satisfied if DSL development can be made as efficient as possible. One way in which to address this challenge is by enabling the reuse of (partial) DSLs in the construction of new DSLs. Reuse of DSLs builds on two found...

متن کامل

SPARTex: A Vertex-Centric Framework for RDF Data Analytics

A growing number of applications require combining SPARQL queries with generic graph search on RDF data. However, the lack of procedural capabilities in SPARQL makes it inappropriate for graph analytics. Moreover, RDF engines focus on SPARQL query evaluation whereas graph management frameworks perform only generic graph computations. In this work, we bridge the gap by introducing SPARTex, an RD...

متن کامل

Killing Two Birds with One Stone - Querying Property Graphs using SPARQL via GREMLINATOR

Knowledge graphs have become popular over the past decade and frequently rely on the Resource Description Framework (RDF) or Property Graph (PG) databases as data models. However, the query languages for these two data models – SPARQL for RDF and the PG traversal language Gremlin – are lacking interoperability. We present Gremlinator, the rst translator from SPARQL – the W3C standardised langua...

متن کامل

Graph Clustering in SPARQL

SPARQL is a powerful engine for querying graphs based on local patterns. We present a method to find a global graph metric, clustering using the PeerPressure algorithm, using RDF/SPARQL. Our approach is extensible to other classes of algorithms such as searches and centrality metrics.

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017